Enhanced image compression with clustering and lookup procedures

ABSTRACT

An image encoder includes a processor and a memory. The memory includes instructions configured to cause the processor to perform operations. In one example implementation, the operations may include determining whether a dictionary item is available for replacing a block of an image being encoded, the determining based on a hierarchical lookup mechanism, and encoding the image along with reference information of the dictionary item in response to determining that the dictionary item is available. In one more example implementation, the operations may include performing principal component analysis (PCA) on a block to generate a corresponding projected block, the block being associated with a group of images, comparing the projected block with a corresponding threshold, descending the block recursively based on the threshold until a condition is satisfied, and identifying a left over block as a cluster upon satisfying of the condition.

FIELD

This application relates, generally, to compressing images.

BACKGROUND

Lossy image compression is generally performed using integral transformsof image pixels (e.g., 8×8 pixels.) and any type of integral transform,e.g., discrete cosine transform (DCT), discrete sine transform (DST),Hadamard, Gabor, Wavelet, etc. may be used. However, the integraltransform process may result in characteristic errors. Thesecharacteristic errors may give the compressed image a characteristiclook and may increase group errors that may be identified as striping orbanding in the uncompressed image, and thereby negatively affecting userexperience.

SUMMARY

In one aspect, an image encoder includes a processor and a memory. Thememory includes instructions configured to cause the processor toperform operations. In one example implementation, the operations mayinclude determining whether a dictionary item is available for replacinga block of an image being encoded, the determining based on ahierarchical lookup mechanism, and encoding the image along withreference information of the dictionary item in response to determiningthat the dictionary item is available. In one more exampleimplementation, the operations may include performing principalcomponent analysis (PCA) on a block to generate a correspondingprojected block, the block being associated with a group of images,comparing the projected block with a corresponding threshold, descendingthe block recursively based on the threshold until a condition issatisfied, and identifying a left over block as a cluster uponsatisfying of the condition.

BRIEF DESCRIPTION OF THE DRAWINGS

Example implementations will become more fully understood from thedetailed description given herein below and the accompanying drawings,wherein like elements are represented by like reference numerals, whichare given by way of illustration only and thus are not limiting of theexample implementations and wherein:

FIG. 1 illustrates a block diagram of an image processing systemaccording to at least one example implementation.

FIG. 2 illustrates a block diagram of an image processing systemaccording to at least another example implementation.

FIG. 3 illustrates an example clustering mechanism according to at leastone example implementation.

FIG. 4 illustrates an example lookup mechanism according to at least oneexample implementation.

FIG. 5A illustrates a flowchart of a method of performing clusteringaccording to least one example implementation.

FIG. 5B illustrates a flowchart of a method of performing lookupmechanism according to least one example implementation.

FIG. 6 shows an example of a computer device and a mobile computerdevice according to at least one example implementation.

It should be noted that these Figures are intended to illustrate thegeneral characteristics of methods, structure, or materials utilized incertain example implementations and to supplement the writtendescription provided below. These drawings are not, however, to scaleand may not precisely reflect the precise structural or performancecharacteristics of any given implementation, and should not beinterpreted as defining or limiting the range of values or propertiesencompassed by example implementation. The use of similar or identicalreference numbers in the various drawings is intended to indicate thepresence of a similar or identical element or feature.

DETAILED DESCRIPTION

An example image encoding (or compression) procedure is describedherein. The image encoding procedure may include a transform process(e.g., DCT transform) to transform an image which has been split intoblocks (e.g., 8×8 blocks) from a pixel domain into a frequency domain.In one implementation, instead of encoding a block (e.g., one or moreblocks of the image) which may include quantizing and entropy encoding,the block may be replaced by a dictionary item (e.g., a dictionary itemof a dictionary) that closely matches the block. In other words, insteadof proceeding with the encoding of DCT coefficients associated with theblock, reference information associated with a dictionary item thatclosely matches the block may be used to replace the block. Thereplacing of a block with a dictionary item may occur when a dictionaryitem that closely matches the block is available in the dictionary(e.g., the dictionary item does not have to be an exact match). The useof the dictionary item eliminates the need for encoding of frequencydomain coefficients of the block. During the decoding process, a decoderuses the dictionary item in the dictionary to successfully decode theimage. That is, the decoder inserts the dictionary item in place of theblock to complete the decoding process. This procedure reduces theamount of data to be transferred from the encoder to the decoder as thesize of the encoded image has been reduced by using dictionary itemsinstead of compressing blocks when a dictionary item that matches theblock is available in the dictionary. In other words, the decoderperforms the decoding using the dictionary item.

In some implementations, an encoder may pre-process a set of images todetermine whether there are features (also referred to as clusters) thatare common across the set of images. If the encoder determines that somefeatures are common across the set of images, the encoder may store thefeatures or clusters together in the dictionary. For example, theencoder may identify, e.g., 100 features or clusters, that are commonacross the set of images. The encoder may store them together in thedictionary and identify them using dictionary item numbers. For example,a vertical line may be referred to as item #25 in the dictionary and maybe used by the encoder when encoding an image which may contain avertical line. The process of grouping together a group of features thatare common across a set of images may be referred to as grouping orclustering and the items in the groups may be used using a lookup table.

FIG. 1 illustrates a block diagram of an example image processing system100 for encoding images.

As shown in FIG. 1, the example image processing system 100 may includeat least one processor 112, at least one memory 114, a controller 116,an encoder 120, and an application 170. The at least one processor 112,the at least one memory 114, the controller 116, the encoder 120, andthe application 170 may be communicatively coupled via bus 118.

The at least one processor 112 may be utilized to execute instructionsstored on the at least one memory 114, so as to thereby implement thevarious features and functions described herein, or additional oralternative features and functions. The at least one processor 112 andthe at least one memory 114 may be utilized for various other purposes.For example, the at least one memory 114 may represent an example ofvarious types of memory and related hardware and software, or acombination thereof, which may be used to implement any one of thecomponents or modules described herein.

The at least one memory 114 may be configured to store data orinformation associated with the image processing system 100. Forexample, the at least one memory 114 may be configured to store codecs(e.g., encoder 120), images (e.g., image 102), encoded images (e.g.,encoded image 132), dictionary (e.g., dictionary 170, dictionary item172) and any reference information (e.g., reference information 174).The at least one memory 114 may be a shared resource. For example, theimage processing system 100 may be an element of a larger system (e.g.,a server, a personal computer, a mobile device, and the like).Therefore, the at least one memory 114 may be configured to store dataor information associated with other elements (e.g., image/videoserving, web browsing, or wired/wireless communications) within thelarger system.

The controller 116 may be configured to generate various control signalsand communicate the control signals to various blocks in the imageprocessing system 100. The controller 116 may be configured to generatethe control signals to implement the techniques (e.g., mechanisms,procedures, etc.) described herein. The controller 116 may be configuredto control the encoder 120 to encode an image, a plurality of images,and the like according to example implementations or aspects. Forexample, the controller 116 may generate control signals correspondingto parameters to implement an encoding mechanism.

In one example implementation, the encoder 120 may determine whether adictionary item (e.g., dictionary item 172) is available for replacing ablock of an image being encoded and encoding the image (e.g. image 102)along with reference information (e.g., reference information 174)associated with the block in response to determining that the dictionaryitem is available.

FIG. 2 illustrates a block diagram of an image processing system 200according to at least one example implementation.

As shown in FIG. 2, an encoder 220 (which may be same or similar to theencoder 120 of FIG. 1) may include a convert RGB to YCbCr component 222,a downsample Cr and Cb component 224, a DCT transform component 226, adictionary component 228, a quantize component 230, and an entropyencode component 232. The decoder 240 may include an entropy decodecomponent 242, a dequantize component 244, an IDCT transform component246, an upsample Cr and Cb component 248, and a convert YCbCr to RGBcomponent 250. In some implementations, the decoder 220 may receive theencoded image 132 from the encoder 220, and may perform decoding togenerate decoded image 260.

In one implementation, the convert RGB to YCbCr component 222 may beconfigured to convert the RGB (e.g., red, green, and blue) values ofpixels in a source image, e.g., image 102, to YCbCr (e.g., luminance andchrominance) values. For example, ITU-RBT.601 establishes the followingformulas for converting from the RGB color space to the YCbCr colorspace:

Y=0.299R+0.587G+0.114B   (1)

Cb=0.564(B−Y)   ( 2 )

Cr=0.713(R−Y)   (3)

In some implementations, the color space conversion may be implementedusing multipliers or look-up tables to achieve the multiplicationoperations, and by combining the resultant component products tocomplete the conversion. In an example implementation, a 3-by-3multiplication may be used for converting between any two color spacesof three color components. To perform the RGB to YCbCr color spaceconversion using equations (1) to (3), convert RGB to YCbCr component222 may be configured to perform (or instruct a processor, e.g.,processor 112, to perform) three multiplication operations to obtain theY color signal, and then derive the (B−Y) and (R−Y) color differencesignals before performing two more multiplication operations to obtainthe Cb and Cr color signals, respectively.

The downsample Cr and Cb component 224 may be configured to separate theY, Cr, and Cb into three image planes. For example, the Y values may befully sampled and the Cr and the Cb values may be down sampled as, forexample, a ¼^(th) vertical and horizontal downsample of the Cr and theCb values.

The discrete cosine transform (DCT) transform component 226 may beconfigured to convert the values of the pixels from a spatial domain totransform coefficients in a transform domain. The transform coefficientsmay correspond to a two-dimensional matrix of coefficients that are thesame size as the original block. In other words, there may be as manytransform coefficients as pixels in the original block. The DCTtransform component 226 may be configured to transform the pixel valuesof a block into transform coefficients in, for example, the frequencydomain. The transform coefficients may include Karhunen-Loève Transform(KLT), Discrete Cosine Transform (DCT), or Singular Value DecompositionTransform (“SVD”).

In some implementations, prior to quantize component 230 quantizing theDCT coefficients, the encoder 220 or the dictionary component 228 maydetermine whether a dictionary item 172 is available in the dictionary170 that could replace a block to be encoded (or being encoded). Inother words, the encoder 220 may determine whether the dictionary item172 is available in the dictionary 170 that could be used to replace theblock so that further encoding of the block may be skipped. In someimplementations, the dictionary 170 and/or the dictionary item(s) 172may be built by the encoder 220 by processing a set of images andidentifying a plurality of features that may be stored together so thatthe encoder 220 may use the dictionary items during the encodingprocess. by referring to the dictionary item using associated referenceinformation. For instance, in one example, a dictionary item may bereferred to as dictionary item #25.

The quantize component 230 may be configured to reduce data in eachtransformation coefficient. Quantization may involve mapping valueswithin a relatively large range to values in a relatively small range,thus reducing the amount of data needed to represent the quantizedtransform coefficients. The quantize component 230 may convert thetransform coefficients into discrete quantum values, which may bereferred to as quantized transform coefficients or quantization levels.For example, an encoding standard may define 128 quantization levels ina scalar quantization process.

The entropy encode component 232 may be configured to perform entropyencoding (e.g., Huffman encoding, arithmetic encoding, etc.) to theblocks. After encoding all the blocks that correspond to the sourceimage (e.g., image 102), the encoder 220 may generate an encoded image(e.g., encoded image 132), also referred to as encoded bitstream.

The entropy decode component 242 may be configured to perform entropydecoding (e.g., Huffman decoding) of the encoded blocks (or bitstream).In performing the entropy decoding, the entropy decode component 242 maydetermine the blocks in the order (e.g., location) in which they wereencoded. However, the entropy decode component 242 may not be able todetermine the location of a block before the entropy decode component242 entropy decodes at least one preceding block because the encodedblocks do not have a fixed size and there are no markers demarcatingblock boundaries. Therefore, for a block to be decoded, the precedingblocks (e.g., in the bitstream or the encoded image 102) should beentropy decoded in order to determine the location of the requestedblock. The dequantize component 244 may be configured to dequantize thequantized transform coefficients. For example, in some implementations,one DC coefficient and 63 AC coefficients may be generated for eachblock (e.g., a minimum coded unit (MCU)) and may be stored (e.g.,temporarily) in a memory (e.g., memory 114) for retrieval by the decoder240.

In some implementations, once dequantize component 244 generates the DCcoefficients and the AC coefficients, IDCT transform component 246 maybe configured to perform IDCT operations (e.g., using the DCcoefficients and the AC coefficients) to inverse transform thedequantized transform coefficients to produce a derivative residual thatmay be identical to that created by the downsample Cr and Cb component224 during the encoding process. The upsample Cr and Cb component 248and the convert YCbCr to RGB component 250 upsample the Cr and the Cbvalues and convert the YCbCr values to RGB using inverse algorithms (ascompared to the convert RGB to YCbCr component 222 and the downsample Crand Cb component 224) to generate RGB values for display, for thedecoded image 260.

FIG. 3 illustrates an example clustering mechanism 300 according to atleast one example implementation. The clustering mechanism 300 is notlimited for DCT coefficients of image blocks but can also be used forany type of data that could be expressed as fixed-length sequences ofnumbers.

The clustering mechanism generates (or creates) clusters from a set ofblocks (e.g., block 302). The blocks 302 may be associated with aplurality of images. The clustering mechanism 300 starts with theprocessing of the blocks 302. In some implementations, each of theblocks may be an 8×8 matrix and each block may be associated with afeature. For instance, a vertical line may be considered as a feature.Principal component analysis (PCA) 304 may be performed on the blocks302 using a projection matrix 306 to generate projected blocks 308. Theprojected blocks 308 may be generated by projecting the projectionmatrix 306 onto an axis of maximum variance. The axis of maximumvariance determines the direction (e.g., in a 64 dimension space) alongwhich the blocks are most diverse. A projected block may be a sequenceof 64 values.

An threshold (e.g., threshold 310) may be determined for each of theprojected blocks 308. A threshold 310 for a projected block may bedetermined, for example, using Otsu's method, which is used to performclustering-based image thresholding. Once the threshold of a projectedblock is determined, the projected block may be split into two partsbased on the threshold. That is, a sequence of a projected block may besplit into two sequences based on the threshold for the projected block.In some implementations, for example, the projected block may be splitinto two parts based on comparing to the threshold, a first part thatincludes a first set of values that are equal to or above the thresholdand a second part that include a second set of values that are below thethreshold.

The splitting of the projected blocks continues, for example,recursively, until a condition (e.g., a termination condition) issatisfied. The condition may be considered satisfied when furthersplitting of the blocks is not possible (e.g., only one block leftover). In some implementations, upon the termination of the splitting ofthe blocks, the left over block (e.g., output of splitting) may beconsidered as a cluster and added to the dictionary 170, for example, asa dictionary item 172.

The mechanism described above generates clusters (or dictionary items)from a set of blocks associated with a plurality of images. As shown inFIG. 3, the projection matrix 306 and the thresholds 310 are stored forexecuting a lookup mechanism 400 of FIG. 4 as described below inreference to FIG. 4.

FIG. 4 illustrates an example lookup mechanism 400 according to at leastone example implementation. The lookup mechanism 400 determines whethera block that is similar (or very similar) is available in the dictionary170 and/or proceeds along the hierarchy (e.g., recursively) to determinethe closest match in the split blocks.

In one implementation, the input to the lookup mechanism 400 may includea block (e.g., block 402), a projection matrix (e.g., projection matrix306), and a threshold (e.g., threshold 310). The projection matrix andthe threshold may be generated, for example, by the clustering mechanism300 of FIG. 3.

The lookup mechanism 400 may include generating a projected block (e.g.,projected block 404) based on the projection matrix. The generating ofthe projected block may be based on the projection matrix that may beprojected onto an axis of maximum variance, as described above inreference to FIG. 3. The projected block may include (e.g., contain) asequence of 64 values that is compared 406 with a threshold (e.g.,threshold 310) to determine whether the sequence is above or below thethreshold value 310. In some implementations, for example, the comparingmay be based on comparing the sum of the squares of the difference.

In some implementations, if it is determined that the sequence is above(or equal to) the threshold value, the lookup mechanism recursivelyconsiders the projection matrix and a threshold corresponding to a upperportion, and if it is determined that the sequence is below thethreshold, the lookup mechanism recursively considers the projectionmatrix and a threshold corresponding to a lower portion. The recursivedescending (e.g., processing, walking along, etc.) continues 408 until acondition (e.g., a termination condition) is met. The splitting endswhen no further splitting is possible, and the cluster being consideredat that time is chosen as a matching cluster.

FIG. 5A illustrates a flowchart 500 of a method of encoding an imageaccording to least one example implementation.

At block 510, the encoder 120 may determine whether a dictionary item isavailable for replacing a block of an image being encoded. For example,in some implementations, as described above in reference to FIG. 2, theencoder 220 (or encoder 120) may determine whether a dictionary item(the dictionary item 172 may be a feature) is available for replacing ablock of an image being encoded. The encoder 220 may determine whether adictionary item associated with the block (e.g., closely matches theblock) is available based on a hierarchical lookup mechanism describedabove in reference to FIG. 4. The encoder 220 may refer to theassociated dictionary item instead of further processing or encoding ofthe block. If the encoder 220 determines that the dictionary item isavailable, the encoder 220 may skip further processing (e.g.,quantizing, entropy encoding) of the block, and may instead simply referto the dictionary item during the encoding process.

At block 520, the encoder may encode the image along with referenceinformation associated with the block in response to determining thatthe dictionary item is available. For example, in some implementations,in response to the encoder 220 determining that the dictionary item isavailable, the encoder 220 may encode the image along with the referenceinformation associated with the block. That is, the encoder replaces theblock with the reference information associated with the block. Thereference information associated with the block may be available in thedictionary 170.

In some implementation, during the decoding process, the referenceinformation allows the decoder 260 to copy the dictionary item (e.g.,which is similar or very similar to the block) from the dictionary 170to complete the decoding process. In other words, the decoder replacesthe reference information of the dictionary item with the dictionaryitem.

In some implementations, at block 530, the encoder may receive adictionary that includes the dictionary item. In a typical scenario, thedictionary 170 would be created ahead of time and distributed to boththe encoder 220 and the decoder 260. As the encoder 220 may havereplaced a block with the reference information associated with theblock (e.g., dictionary item), the decoder 260 needs the dictionary itemto successfully complete the decoding process. Thus, by using referenceinformation of the dictionary items during the encoding process, theencoder 220 reduces the size of encoded images.

FIG. 5B illustrates a flowchart 550 of a lookup mechanism according toleast one example implementation.

At block 560, the encoder 220 may perform principal component analysis(PCA) on a block to generate a corresponding projected block. The blockmay be associated with a group of images. At block 570, the encoder 220may compare the projected block with a corresponding threshold. At block580, the encoder 220 may recursively process a subset of the dictionary(e.g., recursively descend) based on a threshold until a condition issatisfied. At block 590, the encoder 220 may identify a left over blockas a cluster upon satisfying of the condition. In some implementations,for example, as described above in reference to FIG. 4, the encoder 220may determine whether a dictionary item associated with a block of theimage being encoded is available based on the hierarchical lookupmechanism described above in reference to FIG. 4.

FIG. 6 shows an example of a computer device 600 and a mobile computerdevice 650, which may be used with the techniques described here.Computing device 600 is intended to represent various forms of digitalcomputers, such as laptops, desktops, workstations, personal digitalassistants, servers, blade servers, mainframes, and other appropriatecomputers. Computing device 650 is intended to represent various formsof mobile devices, such as personal digital assistants, cellulartelephones, smart phones, and other similar computing devices. Thecomponents shown here, their connections and relationships, and theirfunctions, are meant to be exemplary only, and are not meant to limitimplementations of the inventions described and/or claimed in thisdocument.

Computing device 600 includes a processor 602, memory 604, a storagedevice 606, a high-speed interface 608 connecting to memory 604 andhigh-speed expansion ports 610, and a low speed interface 612 connectingto low speed bus 614 and storage device 606. Each of the components 602,604, 606, 608, 610, and 612, are interconnected using various busses,and may be mounted on a common motherboard or in other manners asappropriate. The processor 602 can process instructions for executionwithin the computing device 600, including instructions stored in thememory 604 or on the storage device 606 to display graphical informationfor a GUI on an external input/output device, such as display 616coupled to high speed interface 608. In other implementations, multipleprocessors and/or multiple buses may be used, as appropriate, along withmultiple memories and types of memory. Also, multiple computing devices600 may be connected, with each device providing portions of thenecessary operations (e.g., as a server bank, a group of blade servers,or a multi-processor system).

The memory 604 stores information within the computing device 600. Inone implementation, the memory 604 is a volatile memory unit or units.In another implementation, the memory 604 is a non-volatile memory unitor units. The memory 604 may also be another form of computer-readablemedium, such as a magnetic or optical disk.

The storage device 606 is capable of providing mass storage for thecomputing device 600. In one implementation, the storage device 606 maybe or contain a computer-readable medium, such as a floppy disk device,a hard disk device, an optical disk device, or a tape device, a flashmemory or other similar solid state memory device, or an array ofdevices, including devices in a storage area network or otherconfigurations. The computer program product can be tangibly embodied inan information carrier. The computer program product may also containinstructions that, when executed, perform one or more methods, such asthose described above. The information carrier is a computer- ormachine-readable medium, such as the memory 604, the storage device 606,or memory on processor 602.

The high speed controller 608 manages bandwidth-intensive operations forthe computing device 600, while the low speed controller 612 manageslower bandwidth-intensive operations. Such allocation of functions isexemplary only. In one implementation, the high-speed controller 608 iscoupled to memory 604, display 616 (e.g., through a graphics processoror accelerator), and to high-speed expansion ports 610, which may acceptvarious expansion cards (not shown). In the implementation, low-speedcontroller 612 is coupled to storage device 606 and low-speed expansionport 614. The low-speed expansion port, which may include variouscommunication ports (e.g., USB, Bluetooth, Ethernet, wireless Ethernet)may be coupled to one or more input/output devices, such as a keyboard,a pointing device, a scanner, or a networking device such as a switch orrouter, e.g., through a network adapter.

The computing device 600 may be implemented in a number of differentforms, as shown in the figure. For example, it may be implemented as astandard server 620, or multiple times in a group of such servers. Itmay also be implemented as part of a rack server system 624. Inaddition, it may be implemented in a personal computer such as a laptopcomputer 622. Alternatively, components from computing device 600 may becombined with other components in a mobile device (not shown), such asdevice 650. Each of such devices may contain one or more of computingdevice 600, 650, and an entire system may be made up of multiplecomputing devices 600, 650 communicating with each other.

Computing device 650 includes a processor 652, memory 664, aninput/output device such as a display 654, a communication interface666, and a transceiver 668, among other components. The device 650 mayalso be provided with a storage device, such as a microdrive or otherdevice, to provide additional storage. Each of the components 650, 652,664, 654, 666, and 668, are interconnected using various buses, andseveral of the components may be mounted on a common motherboard or inother manners as appropriate.

The processor 652 can execute instructions within the computing device650, including instructions stored in the memory 664. The processor maybe implemented as a chipset of chips that include separate and multipleanalog and digital processors. The processor may provide, for example,for coordination of the other components of the device 650, such ascontrol of user interfaces, applications run by device 650, and wirelesscommunication by device 650.

Processor 652 may communicate with a user through control interface 658and display interface 656 coupled to a display 654. The display 654 maybe, for example, a TFT LCD (Thin-Film-Transistor Liquid Crystal Display)or an OLED (Organic Light Emitting Diode) display, or other appropriatedisplay technology. The display interface 656 may comprise appropriatecircuitry for driving the display 654 to present graphical and otherinformation to a user. The control interface 658 may receive commandsfrom a user and convert them for submission to the processor 652. Inaddition, an external interface 662 may be provide in communication withprocessor 652, to enable near area communication of device 650 withother devices. External interface 662 may provide, for example, forwired communication in some implementations, or for wirelesscommunication in other implementations, and multiple interfaces may alsobe used.

The memory 664 stores information within the computing device 650. Thememory 664 can be implemented as one or more of a computer-readablemedium or media, a volatile memory unit or units, or a non-volatilememory unit or units. Expansion memory 674 may also be provided andconnected to device 650 through expansion interface 672, which mayinclude, for example, a SIMM (Single In Line Memory Module) cardinterface. Such expansion memory 674 may provide extra storage space fordevice 650, or may also store applications or other information fordevice 650. Specifically, expansion memory 674 may include instructionsto carry out or supplement the processes described above, and mayinclude secure information also. Thus, for example, expansion memory 674may be provide as a security module for device 650, and may beprogrammed with instructions that permit secure use of device 650. Inaddition, secure applications may be provided via the SIMM cards, alongwith additional information, such as placing identifying information onthe SIMM card in a non-hackable manner.

The memory may include, for example, flash memory and/or NVRAM memory,as discussed below. In one implementation, a computer program product istangibly embodied in an information carrier. The computer programproduct contains instructions that, when executed, perform one or moremethods, such as those described above. The information carrier is acomputer- or machine-readable medium, such as the memory 664, expansionmemory 674, or memory on processor 652, that may be received, forexample, over transceiver 668 or external interface 662.

Device 650 may communicate wirelessly through communication interface666, which may include digital signal processing circuitry wherenecessary. Communication interface 666 may provide for communicationsunder various modes or protocols, such as GSM voice calls, SMS, EMS, orMMS messaging, CDMA, TDMA, PDC, WCDMA, CDMA2000, or GPRS, among others.Such communication may occur, for example, through radio-frequencytransceiver 668. In addition, short-range communication may occur, suchas using a Bluetooth, Wi-Fi, or other such transceiver (not shown). Inaddition, GPS (Global Positioning System) receiver module 670 mayprovide additional navigation- and location-related wireless data todevice 650, which may be used as appropriate by applications running ondevice 650.

Device 650 may also communicate audibly using audio codec 660, which mayreceive spoken information from a user and convert it to usable digitalinformation. Audio codec 660 may likewise generate audible sound for auser, such as through a speaker, e.g., in a handset of device 650. Suchsound may include sound from voice telephone calls, may include recordedsound (e.g., voice messages, music files, etc.) and may also includesound generated by applications operating on device 650.

The computing device 650 may be implemented in a number of differentforms, as shown in the figure. For example, it may be implemented as acellular telephone 680. It may also be implemented as part of a smartphone 682, personal digital assistant, or other similar mobile device.

Various implementations of the systems and techniques described here canbe realized in digital electronic circuitry, integrated circuitry,specially designed ASICs (application specific integrated circuits),computer hardware, firmware, software, and/or combinations thereof.These various implementations can include implementation in one or morecomputer programs that are executable and/or interpretable on aprogrammable system including at least one programmable processor, whichmay be special or general purpose, coupled to receive data andinstructions from, and to transmit data and instructions to, a storagesystem, at least one input device, and at least one output device.Various implementations of the systems and techniques described here canbe realized as and/or generally be referred to herein as a circuit, amodule, a block, or a system that can combine software and hardwareaspects. For example, a module may include the functions/acts/computerprogram instructions executing on a processor (e.g., a processor formedon a silicon substrate, a GaAs substrate, and the like) or some otherprogrammable data processing apparatus.

Some of the above example embodiments are described as processes ormethods depicted as flowcharts. Although the flowcharts describe theoperations as sequential processes, many of the operations may beperformed in parallel, concurrently or simultaneously. In addition, theorder of operations may be re-arranged. The processes may be terminatedwhen their operations are completed, but may also have additional stepsnot included in the figure. The processes may correspond to methods,functions, procedures, subroutines, subprograms, etc.

Methods discussed above, some of which are illustrated by the flowcharts, may be implemented by hardware, software, firmware, middleware,microcode, hardware description languages, or any combination thereof.When implemented in software, firmware, middleware or microcode, theprogram code or code segments to perform the necessary tasks may bestored in a machine or computer readable medium such as a storagemedium. A processor(s) may perform the necessary tasks.

Specific structural and functional details disclosed herein are merelyrepresentative for purposes of describing example embodiments. Exampleembodiments, however, be embodied in many alternate forms and should notbe construed as limited to only the embodiments set forth herein.

It will be understood that, although the terms first, second, etc. maybe used herein to describe various elements, these elements should notbe limited by these terms. These terms are only used to distinguish oneelement from another. For example, a first element could be termed asecond element, and, similarly, a second element could be termed a firstelement, without departing from the scope of example embodiments. Asused herein, the term and/or includes any and all combinations of one ormore of the associated listed items.

It will be understood that when an element is referred to as beingconnected or coupled to another element, it can be directly connected orcoupled to the other element or intervening elements may be present. Incontrast, when an element is referred to as being directly connected ordirectly coupled to another element, there are no intervening elementspresent. Other words used to describe the relationship between elementsshould be interpreted in a like fashion (e.g., between versus directlybetween, adjacent versus directly adjacent, etc.).

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of exampleembodiments. As used herein, the singular forms a, an and the areintended to include the plural forms as well, unless the context clearlyindicates otherwise. It will be further understood that the termscomprises, comprising, includes and/or including, when used herein,specify the presence of stated features, integers, steps, operations,elements and/or components, but do not preclude the presence or additionof one or more other features, integers, steps, operations, elements,components and/or groups thereof

It should also be noted that in some alternative implementations, thefunctions/acts noted may occur out of the order noted in the figures.For example, two figures shown in succession may in fact be executedconcurrently or may sometimes be executed in the reverse order,depending upon the functionality/acts involved.

Unless otherwise defined, all terms (including technical and scientificterms) used herein have the same meaning as commonly understood by oneof ordinary skill in the art to which example embodiments belong. Itwill be further understood that terms, e.g., those defined in commonlyused dictionaries, should be interpreted as having a meaning that isconsistent with their meaning in the context of the relevant art andwill not be interpreted in an idealized or overly formal sense unlessexpressly so defined herein.

Portions of the above example implementations and corresponding detaileddescription are presented in terms of software, or algorithms andsymbolic representations of operation on data bits within a computermemory. These descriptions and representations are the ones by whichthose of ordinary skill in the art effectively convey the substance oftheir work to others of ordinary skill in the art. An algorithm, as theterm is used here, and as it is used generally, is conceived to be aself-consistent sequence of steps leading to a desired result. The stepsare those requiring physical manipulations of physical quantities.Usually, though not necessarily, these quantities take the form ofoptical, electrical, or magnetic signals capable of being stored,transferred, combined, compared, and otherwise manipulated. It hasproven convenient at times, principally for reasons of common usage, torefer to these signals as bits, values, elements, symbols, characters,terms, numbers, or the like.

In the above illustrative implementations, reference to acts andsymbolic representations of operations (e.g., in the form of flowcharts)that may be implemented as program modules or functional processesinclude routines, programs, objects, components, data structures, etc.,that perform particular tasks or implement particular abstract datatypes and may be described and/or implemented using existing hardware atexisting structural elements. Such existing hardware may include one ormore Central Processing Units (CPUs), digital signal processors (DSPs),application-specific-integrated-circuits, field programmable gate arrays(FPGAs) computers or the like.

It should be borne in mind, however, that all of these and similar termsare to be associated with the appropriate physical quantities and aremerely convenient labels applied to these quantities. Unlessspecifically stated otherwise, or as is apparent from the discussion,terms such as processing or computing or calculating or determining ofdisplaying or the like, refer to the action and processes of a computersystem, or similar electronic computing device, that manipulates andtransforms data represented as physical, electronic quantities withinthe computer system's registers and memories into other data similarlyrepresented as physical quantities within the computer system memoriesor registers or other such information storage, transmission or displaydevices.

Note also that the software implemented aspects of the exampleimplementations are typically encoded on some form of non-transitoryprogram storage medium or implemented over some type of transmissionmedium. The program storage medium may be magnetic (e.g., a floppy diskor a hard drive) or optical (e.g., a compact disk read only memory, orCD ROM), and may be read only or random access. Similarly, thetransmission medium may be twisted wire pairs, coaxial cable, opticalfiber, or some other suitable transmission medium known to the art. Theexample implementations not limited by these aspects of any givenimplementation.

Lastly, it should also be noted that whilst the accompanying claims setout particular combinations of features described herein, the scope ofthe present disclosure is not limited to the particular combinationshereafter claimed, but instead extends to encompass any combination offeatures or implementations herein disclosed irrespective of whether ornot that particular combination has been specifically enumerated in theaccompanying claims at this time.

While example implementations may include various modifications andalternative forms, implementations thereof are shown by way of examplein the drawings and will herein be described in detail. It should beunderstood, however, that there is no intent to limit exampleimplementations to the particular forms disclosed, but on the contrary,example implementations are to cover all modifications, equivalents, andalternatives falling within the scope of the claims. Like numbers referto like elements throughout the description of the figures.

What is claimed is:
 1. A method, comprising: determining, at an encoder,whether a dictionary item is available for replacing a block of an imagebeing encoded, the determining based on a hierarchical lookup mechanism;and encoding, at the encoder, the image along with reference informationof the dictionary item in response to determining that the dictionaryitem is available.
 2. The method of claim 1, wherein the hierarchicallookup mechanism comprises: generating a projected block based on acorresponding projection matrix; and comparing the projection matrixwith a corresponding threshold for determining whether the block matchesthe dictionary item.
 3. The method of claim 1, further comprising:receiving, by the encoder, a dictionary that includes the dictionaryitem.
 4. The method of claim 1, wherein the dictionary item isassociated with a feature of the image.
 5. The method of claim 1,wherein a size of the block is an 8×8 matrix.
 6. A method, comprising:performing principal component analysis (PCA) on a block to generate acorresponding projected block, the block being associated with a groupof images; comparing the projected block with a corresponding threshold;descending the block recursively based on the threshold until acondition is satisfied; and identifying a left over block as a clusterupon satisfying of the condition.
 7. The method of claim 6, wherein thethreshold is generated using Otsu's method.
 8. An encoder, comprising: aprocessor; and a memory, the memory including instructions configured tocause the processor to: determine whether a dictionary item is availablefor replacing a block of an image being encoded, the determining basedon a hierarchical lookup mechanism; and encode the image along withreference information of the dictionary item in response to determiningthat the dictionary item is available.
 9. The encoder of claim 8,wherein the processor is further configured to: generate a projectedblock based on a corresponding projection matrix; and compare theprojection matrix with a corresponding threshold for determining whetherthe block matches the dictionary item.
 10. The encoder of claim 8,wherein the processor is further configured to: receive a dictionarythat includes the dictionary item.
 11. The encoder of claim 8, whereinthe dictionary item is associated with a feature of the image.
 12. Theencoder of claim 8, wherein a size of the block is an 8×8 matrix.
 13. Anencoder, comprising: a processor; and a memory, the memory includinginstructions configured to cause the processor to: perform principalcomponent analysis (PCA) on a block to generate a correspondingprojected block, the block being associated with a group of images;compare the projected block with a corresponding threshold; descend theblock recursively based on the threshold until a condition is satisfied;and identify a left over block as a cluster upon satisfying of thecondition.
 14. The encoder of claim 13, wherein the threshold isgenerated using Otsu's method.
 15. A non-transitory computer-readablestorage medium having stored thereon computer executable program codewhich, when executed on a computer system, causes the computer system toperform a method, comprising: determining, at an encoder, whether adictionary item is available for replacing a block of an image beingencoded, the determining based on a hierarchical lookup mechanism; andencoding, at the encoder, the image along with reference information ofthe dictionary item in response to determining that the dictionary itemis available.
 16. The computer-readable storage medium of claim 15,wherein the hierarchical lookup mechanism further comprises code for:generating a projected block based on a corresponding projection matrix;and comparing the projection matrix with a corresponding threshold fordetermining whether the block matches the dictionary item.
 17. Thecomputer-readable storage medium of claim 15, further comprising codefor: receiving, by the encoder, a dictionary that includes thedictionary item.
 18. The computer-readable storage medium of claim 15,wherein a size of the block is an 8×8 matrix.
 19. A non-transitorycomputer-readable storage medium having stored thereon computerexecutable program code which, when executed on a computer system,causes the computer system to perform a method, comprising: performingprincipal component analysis (PCA) on a block to generate acorresponding projected block, the block being associated with a groupof images; comparing the projected block with a corresponding threshold;descending the block recursively based on the threshold until acondition is satisfied; and identifying a left over block as a clusterupon satisfying of the condition.
 20. The computer-readable storagemedium of claim 19, wherein the threshold is generated using Otsu'smethod.